Proof : Let
نویسنده
چکیده
The asynchronous computability theorem for t-resilient tasks. A simple constructive computability theorem for wait-free computation. a spanning tree of G, starting (and ending) at a leaf, and then omitting the last two edges of the tour). Let V be an arbitrary set of n-dimensional vectors such that the adjacency graph G(V) is connected. We now complete the proof of Theorem 2.1 by presenting a wait-free protocol for n processes, P V , such that P V () = V. Let be a traversal of length L of G (L 2jV j ? 4). The protocol for p i is given below: 1. Execute the L-multi-consensus protocol MC L. 2. Let y i be the output of phase 1. p i decides on the i ? th component of the vector (y i). P V is clearly wait-free. We now prove that P V () V. By the Adjacency property of MC L , in each execution e of the protocol, there are two integers k and k+1 such that in phase 1 of the protocol every process decides either on k or on k + 1. Hence there are two adjacent vectors in G, (k) = ~ u = (u 1 ; ; u n) and (k+1) = ~ v = (v 1 ; ; v n), such that every process p i decides either on u i or on v i , and hence the output vector of that execution is either ~ u or ~ v. It remains to prove that every vector ~ v 2 V is the output of some execution of P V. Let ~ u = (u 1 ; ; u n) be any vertex in G. Then there is an integer k, 0 k L, such that (k) = ~ u. By the Multi Consensus property of MC L , there is an execution of MC L during phase 1 of the protocol, in which all the processes decide on k. By extending this execution to any execution in which all the processes are non-faulty, we get that each process p i decides on u i , and hence the output vector is ~ u. This completes the proof of Theorem 2.1. We have characterized the output sets deened by input-free, fault tolerant protocols, and showed that these sets need to preserve connectivity of the output graphs, but otherwise are arbitrary. When considering …
منابع مشابه
Groups with one conjugacy class of non-normal subgroups - a short proof
For a finite group $G$ let $nu(G)$ denote the number of conjugacy classes of non-normal subgroups of $G$. We give a short proof of a theorem of Brandl, which classifies finite groups with $nu(G)=1$.
متن کاملThe Basic Theorem and its Consequences
Let T be a compact Hausdorff topological space and let M denote an n–dimensional subspace of the space C(T ), the space of real–valued continuous functions on T and let the space be equipped with the uniform norm. Zukhovitskii [7] attributes the Basic Theorem to E.Ya.Remez and gives a proof by duality. He also gives a proof due to Shnirel’man, which uses Helly’s Theorem, now the paper obtains a...
متن کاملA SHORT PROOF OF A RESULT OF NAGEL
Let $(R,fm)$ be a Gorenstein local ring and$M,N$ be two finitely generated modules over $R$. Nagel proved that if $M$ and $N$ are inthe same even liaison class, thenone has $H^i_{fm}(M)cong H^i_{fm}(N)$ for all $iIn this paper, we provide a short proof to this result.
متن کاملA NEW PROOF OF THE PERSISTENCE PROPERTY FOR IDEALS IN DEDEKIND RINGS AND PR¨UFER DOMAINS
In this paper, by using elementary tools of commutative algebra,we prove the persistence property for two especial classes of rings. In fact, thispaper has two main sections. In the first main section, we let R be a Dedekindring and I be a proper ideal of R. We prove that if I1, . . . , In are non-zeroproper ideals of R, then Ass1(Ik11 . . . Iknn ) = Ass1(Ik11 ) [ · · · [ Ass1(Iknn )for all k1,...
متن کاملOn Tychonoff's type theorem via grills
Let ${X_{alpha}:alphainLambda}$ be a collection of topological spaces, and $mathcal {G}_{alpha}$ be a grill on $X_{alpha}$ for each $alphainLambda$. We consider Tychonoffrq{}s type Theorem for $X=prod_{alphainLambda}X_{alpha}$ via the above grills and a natural grill on $X$ related to these grills, and present a simple proof to this theorem. This immediately yields the classical theorem...
متن کاملRegularity of second power of edge ideals
Let G be a graph with edge ideal I(G). Benerjee and Nevo proved that for every graph G, the inequality reg(I(G)2)≤reg(I(G))+2 holds. We provide an alternative proof for this result.
متن کامل